欧美老人牲交,qvod色播,国产亚洲精品精品精品

TranslationMobile

劃分問題

"partition" in Chinese : n. 1.分割；分開；被分開；區(qū)分，劃分，配分。 2.區(qū) ...
"problem" in Chinese : n. 1.問題，課題；疑難問題；令人困惑的情況。 2.【 ...
"gpgraph partitioning problem" in Chinese : 圖分割問題
"network-partitioning problem" in Chinese : 網(wǎng)絡(luò)劃分問題
"set partitioning problem" in Chinese : 集合劃分問題
"partitioning" in Chinese : 分成; 分割; 分塊; 分區(qū); 配比; 配分
"affinity partitioning" in Chinese : 親和分配法
"application partitioning" in Chinese : 應(yīng)用程序分段
"aqueous partitioning" in Chinese : 水相分配
"chromatic partitioning" in Chinese : 染色劃分
"covariance partitioning" in Chinese : 協(xié)方差的分割法; 協(xié)方差分割法
"data partitioning" in Chinese : 數(shù)據(jù)分割; 數(shù)據(jù)劃分
"design partitioning" in Chinese : 分塊化設(shè)計,模塊化設(shè)計
"disk partitioning" in Chinese : 分割 (子算); 硬磁碟分割
"dynamic partitioning" in Chinese : 動態(tài)劃分

Examples

Tree partition problems with some fixed vertices
固定頂點的樹劃分問題
In chapter 2 we study two parallel machines scheduling to maximize non - delay jobs . the problem is np - hard for it contains a sub problem equivalent to partition problem
第二章討論兩臺平行機(jī)排序極大化按期完工工件數(shù)問題，由于它的一個子問題等價于劃分問題，因而該問題是一個np -難的問題。
In order to further reduce the complexity of super large - scale integration design and enhance graphical readability , a hybrid genetic algorithm for solving circuit partitioning problem was presented
摘要為了進(jìn)一步降低超大型規(guī)模集成電路設(shè)計的復(fù)雜性、增強(qiáng)圖形可讀性，提出了一種求解電路劃分問題的混合式遺傳算法。
In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems
在第二章至第五章中，我們分別研究了四個組合優(yōu)化問題的近似算法，并給出了它們的性能分析。
In ttg model , task is the base design granularity , the partition of task affect the quality of system design heavily . the thesis addresses the importance of the task partition problem and presents a task partition method based the closeness measurements of system behavior objec1fs
Ttg模型中以任務(wù)作為設(shè)計的基本粒度，本文指出了任務(wù)劃分問題的重要性，并提出了基于系統(tǒng)行為對象關(guān)系度量進(jìn)行任務(wù)劃分的方法。
It is a newly arisen data mining method in the recent years , and it is also the end target of the data mining . it applies the data mining method into practice . profit mining mainly includes the merchandise choice problem and catalogue partition problem
本文使用有向項集圖代替fp - mpis - tree重新實現(xiàn)了mpis算法,并提出了使用memetic算法解決商品選擇問題,利用利潤挖掘方法得到的結(jié)果解決面向顧客的目錄分割問題,使用meme算法解決目錄分割問題,實現(xiàn)了兩個目錄覆蓋算法。